Completion Delay Minimization for Instantly Decodable Network Codes
نویسندگان
چکیده
منابع مشابه
On Minimizing Multicast Completion Delay for Instantly Decodable Network Coding
In this paper, we consider the problem of minimizing the mean completion delay in wireless multicast for instantly decodable network coding. We first formulate the problem as a stochastic shortest path (SSP) problem. Although finding the optimal selection policy using SSP is intractable, we use this formulation to draw the theoretical properties of efficient selection algorithms. Based on these...
متن کاملDelay Minimization for Instantly Decodable Network Coding in Persistent Channels with Feedback Intermittence
In this paper, we consider the problem of minimizing the multicast decoding delay of generalized instantly decodable network coding (G-IDNC) over persistent forward and feedback erasure channels with feedback intermittence. In such environment, the sender does not always receive acknowledgement from the receivers after each transmission. Moreover, both the forward and feedback channels are subj...
متن کاملDecoding Delay Controlled Reduction of Completion Time in Instantly Decodable Network Coding
For several years, the completion time and the decoding delay problems in Instantly Decodable Network Coding (IDNC) were considered separately and were thought to completely act against each other. Recently, some works aimed to balance the effects of these two important IDNC metrics but none of them studied a further optimization of one by controlling the other. In this paper, we study the effe...
متن کاملOn Improving the Balance between the Completion Time and Decoding Delay in Instantly Decodable Network Coded Systems
This paper studies the complicated interplay of the completion time (as a measure of throughput) and the decoding delay performance in instantly decodable network coded (IDNC) systems over wireless broadcast erasure channels with memory, and proposes two new algorithms that improve the balance between the completion time and decoding delay of broadcasting a block of packets. We first formulate ...
متن کاملInstantly Decodable versus Random Linear Network Coding: A Comparative Framework for Throughput and Decoding Delay Performance
This paper studies the tension between throughput and decoding delay performance of two widely-used network coding schemes: random linear network coding (RLNC) and instantly decodable network coding (IDNC). A single-hop broadcasting system model is considered that aims to deliver a block of packets to all receivers in the presence of packet erasures. For a fair and analytically tractable compar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Networking
سال: 2015
ISSN: 1063-6692,1558-2566
DOI: 10.1109/tnet.2014.2338053